A Linearization Approach to Multiobjective Programming Duality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Second Order Duality in Multiobjective Programming

A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.

متن کامل

Symmetric duality for a higher-order nondifferentiable multiobjective programming problem

*Correspondence: [email protected] 1Department of Mathematics, Indian Institute of Technology, Roorkee, 247 667, India Full list of author information is available at the end of the article Abstract In this paper, a pair of Wolfe type higher-order nondifferentiable symmetric dual programs over arbitrary cones has been studied and then well-suited duality relations have been established consider...

متن کامل

Symmetric Duality for a Class of Multiobjective Programming

We formulate a pair of symmetric dual nondifferentiable multiobjective programming and establish appropriate duality theorems. We also show that differentiable and nondifferentiable analogues of several pairs of symmetric dual problems can be obtained as special cases of our general symmetric programs.

متن کامل

A Convex Programming Approach to the Multiobjective H2/H” Problem

In this paper, Banach space duality theory for the multiobjective H 2 / H m problem developed recently by the authors, is used to develop algorithms to solve this problem by approximately reducing the dual and predual reperesentations to finite variable convex optimizations. The Ellipsoid algorithm is then a p plied to these problems to obtain polynomial-time, nonheuristic programs which find “...

متن کامل

A Compromise Programming Approach to multiobjective Markov Decision Processes

A Markov decision process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagent problems in which the value of a decision must be evaluated according to several viewpoints, sometimes con°icting. Although most of the studies concentrate on the determination of the set of Pareto-optimal policies,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1993

ISSN: 0022-247X

DOI: 10.1006/jmaa.1993.1167